排序方式: 共有115条查询结果,搜索用时 15 毫秒
101.
The novel pyridinium chloride-functionalized MnCoFe2O4-SO3H nanoparticles, (MnCoFe2O4@Niacin-SO3H)+Cl?, were synthesized by coating the sulfonic group on the surface of MnCoFe2O4@Niacin. The activity of these nanoparticles was studied for the synthesis of tetrahydrodipyrazolopyridines and pyranopyrazole derivatives via the multi-component reactions of ethyl acetate, hydrazine, aldehydes, and ammonium acetate or malononitrile. The use of green solvent, easy separation of the catalyst from the reaction medium, easy deposition, high purity, and openness of products are some advantages of this procedure.
相似文献102.
Peyman Salehi Behnam Seddighi Mohsen Irandoost Farahnaz Kargar Behbahani 《合成通讯》2013,43(16):2967-2973
Regio- and stereoselective ring opening reaction of epoxides is achieved efficiently by aliphatic alcohols and water in the presence of catalytic amounts of ferric perchlorate. 相似文献
103.
Mohammad M. Mojtahedi M. Saeed Abaee Majid M. Heravi Farahnaz K. Behbahani 《Monatshefte für Chemie / Chemical Monthly》2007,138(1):95-99
Summary. Amines with different stereoelectronic nature were efficiently acylated at room temperature using acetic anhydride in the
presence of no solvent or additive. Various thiols also react equally well under the same conditions. Chemoselective protection
of amines in the presence of thiols, alcohols, and phenols and of thiols in the presence of alcohols, and phenols were achieved
using competitive experiments. 相似文献
104.
105.
G.R. Omidi 《Linear algebra and its applications》2008,428(7):1696-1705
A graph is said to be determined by the adjacency and Laplacian spectrum (or to be a DS graph, for short) if there is no other non-isomorphic graph with the same adjacency and Laplacian spectrum, respectively. It is known that connected graphs of index less than 2 are determined by their adjacency spectrum. In this paper, we focus on the problem of characterization of DS graphs of index less than 2. First, we give various infinite families of cospectral graphs with respect to the adjacency matrix. Subsequently, the results will be used to characterize all DS graphs (with respect to the adjacency matrix) of index less than 2 with no path as a component. Moreover, we show that most of these graphs are DS with respect to the Laplacian matrix. 相似文献
106.
Hossien A. Oskooie Majid M. Heravi Akbar Sadnia Fatemeh Jannati Farahnaz K. Behbahani 《Monatshefte für Chemie / Chemical Monthly》2008,139(1):27-29
Summary. The multicomponent Strecker reaction using trimethylsilyl cyanide was performed at room temperature and α-aminonitriles were prepared in excellent yields
in the presence of a catalytic amount of H2SO4 adsorbed on silica gel. 相似文献
107.
Nanocomposites are a promising new class of structural materials for the aerospace structural components. This paper presents
a detailed theoretical investigation of dynamic characteristics of cylinders made of carbon nanotube-reinforced composites.
The cylinders are modeled as a cylindrical shell consisting of an isotropic matrix reinforced with transversely isotropic
carbon nanotubes. Two different types of carbon nanotube reinforcements are considered: single-walled carbon nanotubes (SWNTs)
and multi-walled carbon nanotubes (MWNTs). The effects of carbon nanotube aspect ratio, dispersion, alignment and volume fraction
on the elastic modulus are analyzed using the Eshelby–Mori–Tanaka theory. Mass and stiffness matrices are obtained via Ritz
method and natural frequencies of the structure are derived through solving the eigenvalue problem. Finally, the effects of
the CNT distribution on mode shapes and natural frequencies are discussed. 相似文献
108.
In this paper, we study the group and list group colorings of total graphs and present group coloring versions of the total and list total colorings conjectures. We establish the group coloring version of the total coloring conjecture for the following classes of graphs: graphs with small maximum degree, two-degenerate graphs, planner graphs with maximum degree at least 11, planner graphs without certain small cycles, outerplanar graphs and near outerplanar graphs with maximum degree at least 4. In addition, the group version of the list total coloring conjecture is established for forests, outerplanar graphs and graphs with maximum degree at most two. 相似文献
109.
2-Phenylindoles were prepared by heteroannulation of 2-haloaniline derivatives and phenylacetylene under mild conditions in a one-pot reaction catalyzed by Pd(PPh3)2Cl2. 相似文献
110.
G. R. Omidi 《Graphs and Combinatorics》2011,27(2):269-273
In this paper we show that the group choice number of a graph without K
5-minor or K
3,3-minor with girth at least 4 (resp. 6) is at most 4 (resp. 3) and we conclude that these results hold for the group chromatic
number, the choice number and the chromatic number. 相似文献